A Pair of Higher Order Symmetric Nondifferentiable Multiobjective Mini-maxmixed Programming Problems
نویسندگان
چکیده
A PAIR OF HIGHER ORDER SYMMETRIC NONDIFFERENTIABLE MULTIOBJECTIVE MINI-MAXMIXED PROGRAMMING PROBLEMS Aruna Kumar Tripathy1 and Gayatri Devi2 1Department of Mathematics, Trident Academy of Technology, F2/A, Chandaka Industrial Estate, Bhubaneswar-24, Odisha, India, E-mail: [email protected] 2Department of Mathematics, ABIT, Cuttack, Odisha, India, E-mail: [email protected] A pair of higher order symmetric non differentiable minimax mixed programming problem where each objective function contains support function of compact convex set in Rn, is formulated. Under higher order F-convexity assumption, weak, strong and converse symmetric duality theorems related to a properly efficient solution and selfduality are proved
منابع مشابه
Symmetric Duality for a Class of Multiobjective Programming
We formulate a pair of symmetric dual nondifferentiable multiobjective programming and establish appropriate duality theorems. We also show that differentiable and nondifferentiable analogues of several pairs of symmetric dual problems can be obtained as special cases of our general symmetric programs.
متن کاملNondifferentiable second order symmetric duality in multiobjective programming
A pair of Mond–Weir type nondifferentiable multiobjective second order symmetric dual programs is formulated and symmetric duality theorems are established under the assumptions of second order F-pseudoconvexity/ F-pseudoconcavity. © 2005 Elsevier Ltd. All rights reserved.
متن کاملHigher-order symmetric duality for a class of multiobjective fractional programming problems
Correspondence: gaoyingimu@163. com Department of Mathematics, Chongqing Normal University, Chongqing 400047, China Abstract In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, a, r, d)-convexity, which extends some kinds of generalized convexity, such as second or...
متن کاملSecond order symmetric duality in nondifferentiable multiobjective programming
A pair of Mond–Weir type second order symmetric nondifferentiable multiobjective programs is formulated. Weak, strong and converse duality theorems are established under g-pseudobonvexity assumptions. Special cases are discussed to show that this paper extends some work appeared in this area. 2004 Elsevier Inc. All rights reserved.
متن کاملOn Nondifferentiable Higher-Order Symmetric Duality in Multiobjective Programming Involving Cones
In this paper, we point out some deficiencies in a recent paper (Lee and Kim in J. Nonlinear Convex Anal. 13:599–614, 2012), and we establish strong duality and converse duality theorems for two types of nondifferentiable higher-order symmetric duals multiobjective programming involving cones.
متن کامل